Minimizing makespan of a production batch within concurrent systems: Seru production perspective
نویسندگان
چکیده
منابع مشابه
Approximation Algorithm of Minimizing Makespan in Parallel Bounded Batch Scheduling∗
We consider the problem of minimizing the makespan(Cmax) on m identical parallel batch processing machines. The batch processing machine can process up to B jobs simultaneously. The jobs that are processed together form a batch, and all jobs in a batch start and complete at the same time. For a batch of jobs, the processing time of the batch is equal to the largest processing time among the job...
متن کاملA Concurrent Architecture for Serializable Production Systems
This paper presents a new production system architecture that takes advantage of modern associative memory devices to allow parallel production ring, concurrent matching, and overlap among matching, selection, and ring of productions. We prove that the results produced by the architecture are correct according to the serializability criterion. A comprehensive event driven simulator is used to e...
متن کاملFed-Batch Production of a Fermented Beverage Containing Vitamin B12
Production of fermented functional foods containing micronutrients is required for their health beneficial properties. The impact of 11 process variables on vitamin B12 production in a dairy beverage containing propionic acid was investigated. Propionibacterium freudenreichii ssp. shermanii was applied in a 3-l fermentor in the fed-batch fermentation system. The most suitable conditions for...
متن کاملfaciliting lexical access for the fluent production of speech
the hypothesis is that recent and frequent exposure to lexical items leads to a more fluent production of speech in terms of rate of speech. to test the hypothesis,a one-way anova experimental design was carried out. 24 sednior students of efl participated in a one-way interview test. data analyses revealed that those who were exposed frequently to the lexical items over a week prior to inter...
15 صفحه اولMinimizing a Makespan Under Uncertainty
This paper reconsiders the most basic scheduling problem, that of minimizing the makespan of a partially ordered set of activities, in the context of incomplete knowledge. After positioning this paper in the scope of temporal networks under uncertainty, we provide a complete solution to the problem of finding floats of activities, and of locating surely critical ones, as they are often isolated...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Management Science and Engineering
سال: 2020
ISSN: 2096-2320
DOI: 10.1016/j.jmse.2020.10.002